منابع مشابه
Summary of Sinc Numerical Methods
Contents Abstract Sinc approximation methods excel for problems whose solutions may have singularities, or innnite domains, or boundary layers. This article summarizes results obtained to date, on Sinc numerical methods of computation. Sinc methods provide procedures for function approximation over bounded or unbounded regions, encompassing interpolation, approximation of derivatives, approxima...
متن کاملMatrices of Sinc Methods
This paper gives a brief review of Sinc methods, with emphasis on the matrices of Sinc methods. A novel procedure is presented, based on Sinc convolution, for solving a Poisson problem over a rectangular region. Although some of the work of Gragg and Reichel may already be applied to the solution of Sinc{matrix problems, this paper also points to new directions of matrix research.
متن کاملTheoretical analysis of Sinc-collocation methods and Sinc-Nyström methods for initial value problems
A Sinc-collocation method has been proposed by Stenger, and he also gave theoretical analysis of the method in the case of a ‘scalar’ equation. This paper extends the theoretical results to the case of a ‘system’ of equations. Furthermore, this paper proposes more efficient method by replacing the variable transformation employed in Stenger’s method. The efficiency is confirmed by both of theor...
متن کاملExplicit Error Bound for Modified Numerical Iterated Integration by Means of Sinc Methods
This paper reinforces numerical iterated integration developed by Muhammad–Mori in the following two points: 1) the approximation formula is modified so that it can achieve a better convergence rate in more general cases, and 2) explicit error bound is given in a computable form for the modified formula. The formula works quite efficiently, especially if the integrand is of a product type. Nume...
متن کاملAdvection-diffusion Equations: Temporal Sinc Methods
A fully Sinc-Galerkin method for solving advection-di usion equations subject to arbitrary radiation boundary conditions is presented. This procedure gives rise to a discretization which has it's most natural representation in the form of a Sylvester system where the coe cient matrix for the temporal discretization is full. The word \full" often implies a computationally more complex method com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2000
ISSN: 0377-0427
DOI: 10.1016/s0377-0427(00)00348-4